An Analogue of Hajós' Theorem for the Circular Chromatic Number (II)
نویسنده
چکیده
This paper designs a set of graph operations and proves that starting from Gd , by repeatedly applying these operations, one can construct all graphs G with χc(G) ≥ k/d (for k/d ≥ 3). This can be viewed as an analogue of Hajós’ Theorem for the circular chromatic number.
منابع مشابه
An Analogue of Hajós’ Theorem for the Circular Chromatic Number
This paper designs a set of graph operations and proves that starting from Gd , by repeatedly applying these operations, one can construct all graphs G with χc(G) ≥ k/d (for k/d ≥ 3). This can be viewed as an analogue of Hajós’ Theorem for the circular chromatic number.
متن کاملHajós Theorem For Colorings Of Edge-Weighted Graphs
Hajj os theorem states that every graph with chromatic number at least k can be obtained from the complete graph K k by a sequence of simple operations such that every intermediate graph also has chromatic number at least k. Here, Hajj os theorem is extended in three slightly diierent ways to colorings and circular colorings of edge-weighted graphs. These extensions shed some new light on the H...
متن کاملA short construction of highly chromatic digraphs without short cycles
A natural digraph analogue of the graph-theoretic concept of an ‘independent set’ is that of an ‘acyclic set’, namely a set of vertices not spanning a directed cycle. Hence a digraph analogue of a graph coloring is a decomposition of the vertex set into acyclic sets. In the spirit of a famous theorem of P. Erdős [Graph theory and probability, Canad. J. Math. 11 (1959), 34–38], it was shown prob...
متن کاملعدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کامل0 40 70 75 v 3 2 6 N ov 2 00 4 Local chromatic number , Ky Fan ’ s theorem , and circular colorings
The local chromatic number of a graph was introduced in [12]. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local chromatic number of graphs for which these quantities are far apart. Such graphs include Kneser graphs, their vertex color-critical subgraphs, the Schrijver (or stable Kneser) graphs; Mycielski graphs, and their generalizations; and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 19 شماره
صفحات -
تاریخ انتشار 2003